On Forward Closure and the Finite Variant Property
Identifieur interne : 001526 ( Main/Exploration ); précédent : 001525; suivant : 001527On Forward Closure and the Finite Variant Property
Auteurs : Christopher Bouchard [États-Unis] ; Kimberly A. Gero [États-Unis] ; Christopher Lynch [États-Unis] ; Paliath Narendran [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Equational unification is an important research area with many applications, such as cryptographic protocol analysis. Unification modulo a convergent term rewrite system is undecidable, even with just a single rule. To identify decidable (and tractable) cases, two paradigms have been developed — Basic Syntactic Mutation [14] and the Finite Variant Property [6]. Inspired by the Basic Syntactic Mutation approach, we investigate the notion of forward closure along with suitable redundancy constraints. We show that a convergent term rewriting system R has a finite forward closure if and only if R has the finite variant property. We also show the undecidability of the finiteness of forward closure, therefore determining if a system has the finite variant property is undecidable.
Url:
DOI: 10.1007/978-3-642-40885-4_23
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000609
- to stream Istex, to step Curation: 000604
- to stream Istex, to step Checkpoint: 000152
- to stream Main, to step Merge: 001538
- to stream Main, to step Curation: 001526
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On Forward Closure and the Finite Variant Property</title><author><name sortKey="Bouchard, Christopher" sort="Bouchard, Christopher" uniqKey="Bouchard C" first="Christopher" last="Bouchard">Christopher Bouchard</name></author><author><name sortKey="Gero, Kimberly A" sort="Gero, Kimberly A" uniqKey="Gero K" first="Kimberly A." last="Gero">Kimberly A. Gero</name></author><author><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name></author><author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1AF919A5D36F51B0787DC1DCB3EDAE2ACDD8A979</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40885-4_23</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-BDCK6X8B-S/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000609</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000609</idno><idno type="wicri:Area/Istex/Curation">000604</idno><idno type="wicri:Area/Istex/Checkpoint">000152</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000152</idno><idno type="wicri:doubleKey">0302-9743:2013:Bouchard C:on:forward:closure</idno><idno type="wicri:Area/Main/Merge">001538</idno><idno type="wicri:Area/Main/Curation">001526</idno><idno type="wicri:Area/Main/Exploration">001526</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On Forward Closure and the Finite Variant Property</title><author><name sortKey="Bouchard, Christopher" sort="Bouchard, Christopher" uniqKey="Bouchard C" first="Christopher" last="Bouchard">Christopher Bouchard</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>University at Albany—SUNY, Albany, NY</wicri:regionArea><placeName><region type="state">État de New York</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Gero, Kimberly A" sort="Gero, Kimberly A" uniqKey="Gero K" first="Kimberly A." last="Gero">Kimberly A. Gero</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>University at Albany—SUNY, Albany, NY</wicri:regionArea><placeName><region type="state">État de New York</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Clarkson University, Potsdam, NY</wicri:regionArea><placeName><region type="state">État de New York</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>University at Albany—SUNY, Albany, NY</wicri:regionArea><placeName><region type="state">État de New York</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Equational unification is an important research area with many applications, such as cryptographic protocol analysis. Unification modulo a convergent term rewrite system is undecidable, even with just a single rule. To identify decidable (and tractable) cases, two paradigms have been developed — Basic Syntactic Mutation [14] and the Finite Variant Property [6]. Inspired by the Basic Syntactic Mutation approach, we investigate the notion of forward closure along with suitable redundancy constraints. We show that a convergent term rewriting system R has a finite forward closure if and only if R has the finite variant property. We also show the undecidability of the finiteness of forward closure, therefore determining if a system has the finite variant property is undecidable.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>État de New York</li></region></list><tree><country name="États-Unis"><region name="État de New York"><name sortKey="Bouchard, Christopher" sort="Bouchard, Christopher" uniqKey="Bouchard C" first="Christopher" last="Bouchard">Christopher Bouchard</name></region><name sortKey="Bouchard, Christopher" sort="Bouchard, Christopher" uniqKey="Bouchard C" first="Christopher" last="Bouchard">Christopher Bouchard</name><name sortKey="Gero, Kimberly A" sort="Gero, Kimberly A" uniqKey="Gero K" first="Kimberly A." last="Gero">Kimberly A. Gero</name><name sortKey="Gero, Kimberly A" sort="Gero, Kimberly A" uniqKey="Gero K" first="Kimberly A." last="Gero">Kimberly A. Gero</name><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001526 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001526 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:1AF919A5D36F51B0787DC1DCB3EDAE2ACDD8A979
|texte= On Forward Closure and the Finite Variant Property
}}
| This area was generated with Dilib version V0.6.33. |  |